A Hybrid Genetic Approach for Circuit Bipartitioning
نویسندگان
چکیده
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic which is a modification of Fiduccia-Matheyses algorithm. Using well-known benchmarks (including ACM/SIGDA benchmarks), the combination of genetic algorithm and the local heuristic performed better than hMetis, a representative circuit partitioning algorithm.
منابع مشابه
A Hybrid Genetic Search For Circuit Bipartitioning
The Fiduccia-Matheyses algorithm (FM) [1] is a representative iterative improvement algorithm for a hypergraph partitioning problem. But the quality of the FM is not stable. Kim and Moon [3] introduced lock gain as a primary measure for choosing the nodes to move. It uses the history of search more eÆciently. Lock gain showed excellent performance for general graphs. We adapt the lock gain for ...
متن کاملHybrid evolutionary partitioning algorithm for heat transfer enhancement in VLSI circuits
In this paper, a new approach to improving the heat transfer in integrated circuits (ICs) is presented. It is based on improving the thermal conductivity of ICs by increasing the number of their external connections up to the level determined by the packaging standard. In order to attain this goal, a new hybrid evolutionary partitioning algorithm (HEPA) for circuits partitioning is introduced. ...
متن کاملOptimal Multiple FCLs Allocation Considering DG Penetration in Meshed Network With Multi-Level Voltages
Increasing the short circuit current due to the penetration of distributed generations (DGs) in various voltage levels and meshed topology is a basic problem in power systems. Using fault current limiter (FCL) is an efficient approach to mitigate the exceeded short circuit levels. In this paper, a new approach is presented for multiple FCLs locating to decrease short circuit levels in meshed ne...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملE cient Network Flow Based Min-Cut Balanced Partitioning
We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, the Kernighan and Lin type (K&L) heuristics, the simulated annealing approach, and the spectral method were given to solve the problem. However, network ow techniques were overlooked as a viable approach to min-cut balanced bipartition due to its high complexi...
متن کامل